0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.36 % Computer : n026.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 960 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Aug 9 03:26:49 EDT 2022 0.14/0.36 % CPUTime : 0.21/0.46 Running higher-order on 8 cores theorem proving 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.21/0.46 # Version: 3.0pre003-ho 0.21/0.47 # Preprocessing class: HSMSSMSSMLMNHSN. 0.21/0.47 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.47 # Starting ho_unfolding_3 with 600s (5) cores 0.21/0.47 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.21/0.47 # Starting almost_fo_3_lam with 120s (1) cores 0.21/0.47 # Starting post_as_ho1 with 120s (1) cores 0.21/0.47 # ehoh_best2_full_lfho with pid 3139 completed with status 0 0.21/0.47 # Result found by ehoh_best2_full_lfho 0.21/0.47 # Preprocessing class: HSMSSMSSMLMNHSN. 0.21/0.47 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.47 # Starting ho_unfolding_3 with 600s (5) cores 0.21/0.47 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.21/0.47 # No SInE strategy applied 0.21/0.47 # Search class: HHHNS-FFSF11-SHSSMFNN 0.21/0.47 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.21/0.47 # Starting new_ho_10 with 65s (1) cores 0.21/0.47 # new_ho_10 with pid 3142 completed with status 0 0.21/0.47 # Result found by new_ho_10 0.21/0.47 # Preprocessing class: HSMSSMSSMLMNHSN. 0.21/0.47 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.47 # Starting ho_unfolding_3 with 600s (5) cores 0.21/0.47 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.21/0.47 # No SInE strategy applied 0.21/0.47 # Search class: HHHNS-FFSF11-SHSSMFNN 0.21/0.47 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.21/0.47 # Starting new_ho_10 with 65s (1) cores 0.21/0.47 # Preprocessing time : 0.003 s 0.21/0.47 # Presaturation interreduction done 0.21/0.47 0.21/0.47 # Proof found! 0.21/0.47 # SZS status Theorem 0.21/0.47 # SZS output start CNFRefutation 0.21/0.47 thf(decl_22, type, qmltpeq: mu > mu > $i > $o). 0.21/0.47 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.21/0.47 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_26, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_27, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.21/0.47 thf(decl_28, type, mtrue: $i > $o). 0.21/0.47 thf(decl_29, type, mfalse: $i > $o). 0.21/0.47 thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_31, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_32, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_33, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_34, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_35, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.21/0.47 thf(decl_36, type, exists_in_world: mu > $i > $o). 0.21/0.47 thf(decl_37, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.21/0.47 thf(decl_38, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.21/0.47 thf(decl_39, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.21/0.47 thf(decl_40, type, mreflexive: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_41, type, msymmetric: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_42, type, mserial: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_43, type, mtransitive: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_44, type, meuclidean: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_45, type, mpartially_functional: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_46, type, mfunctional: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_47, type, mweakly_dense: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_49, type, mweakly_directed: ($i > $i > $o) > $o). 0.21/0.47 thf(decl_50, type, mvalid: ($i > $o) > $o). 0.21/0.47 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.21/0.47 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.21/0.47 thf(decl_53, type, minvalid: ($i > $o) > $o). 0.21/0.47 thf(decl_54, type, rel_s4: $i > $i > $o). 0.21/0.47 thf(decl_55, type, mbox_s4: ($i > $o) > $i > $o). 0.21/0.47 thf(decl_56, type, mdia_s4: ($i > $o) > $i > $o). 0.21/0.47 thf(decl_57, type, big_p: mu > $i > $o). 0.21/0.47 thf(decl_58, type, esk1_1: $i > mu). 0.21/0.47 thf(decl_59, type, esk2_0: $i). 0.21/0.47 thf(decl_60, type, esk3_0: $i). 0.21/0.47 thf(decl_61, type, esk4_0: mu). 0.21/0.47 thf(decl_62, type, esk5_1: mu > $i). 0.21/0.47 thf(decl_63, type, esk6_1: mu > $i). 0.21/0.47 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o]:(mor @ (mnot @ X4) @ X5))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mimplies)). 0.21/0.47 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mnot)). 0.21/0.47 thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mor)). 0.21/0.47 thf(mexists_ind, axiom, ((mexists_ind)=(^[X12:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X13:mu]:(mnot @ (X12 @ X13))))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mexists_ind)). 0.21/0.47 thf(mforall_ind, axiom, ((mforall_ind)=(^[X10:mu > $i > $o, X3:$i]:(![X11:mu]:(((exists_in_world @ X11 @ X3)=>(X10 @ X11 @ X3)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mforall_ind)). 0.21/0.47 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mvalid)). 0.21/0.47 thf(mbox_s4, axiom, ((mbox_s4)=(^[X4:$i > $o, X3:$i]:(![X7:$i]:((~((rel_s4 @ X3 @ X7))|(X4 @ X7)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mbox_s4)). 0.21/0.47 thf(x2108, conjecture, (mvalid @ (mbox_s4 @ (mforall_ind @ (^[X20:mu]:(mexists_ind @ (^[X21:mu]:(mbox_s4 @ (mimplies @ (mbox_s4 @ (big_p @ X20)) @ (mbox_s4 @ (big_p @ X21)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', x2108)). 0.21/0.47 thf(c_0_8, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.21/0.47 thf(c_0_9, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.21/0.47 thf(c_0_10, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.21/0.47 thf(c_0_11, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X28:mu]:(((exists_in_world @ X28 @ Z1)=>(~((Z0 @ X28 @ Z1)))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])). 0.21/0.47 thf(c_0_12, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X11:mu]:(((exists_in_world @ X11 @ Z1)=>(Z0 @ X11 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_ind])). 0.21/0.47 thf(c_0_13, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 0.21/0.47 thf(c_0_14, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X28:mu]:(((exists_in_world @ X28 @ Z1)=>(~((Z0 @ X28 @ Z1)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_9]), c_0_12])). 0.21/0.47 thf(c_0_15, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.21/0.47 thf(c_0_16, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X7:$i]:((~((rel_s4 @ Z1 @ X7))|(Z0 @ X7)))))), inference(fof_simplification,[status(thm)],[mbox_s4])). 0.21/0.47 thf(c_0_17, negated_conjecture, ~(![X41:$i, X40:$i]:((~(rel_s4 @ X41 @ X40)|![X39:mu]:(((exists_in_world @ X39 @ X40)=>~(![X38:mu]:(((exists_in_world @ X38 @ X40)=>~(![X37:$i]:((~(rel_s4 @ X40 @ X37)|(~(![X35:$i]:((~(rel_s4 @ X37 @ X35)|(big_p @ X39 @ X35))))|![X36:$i]:((~(rel_s4 @ X37 @ X36)|(big_p @ X38 @ X36))))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2108])]), c_0_13]), c_0_12]), c_0_14]), c_0_15]), c_0_16])])). 0.21/0.47 thf(c_0_18, negated_conjecture, ![X54:mu, X56:$i]:(((rel_s4 @ esk2_0 @ esk3_0)&((exists_in_world @ esk4_0 @ esk3_0)&(((rel_s4 @ esk3_0 @ (esk5_1 @ X54))|~(exists_in_world @ X54 @ esk3_0))&((~(rel_s4 @ (esk5_1 @ X54) @ X56)|(big_p @ esk4_0 @ X56)|~(exists_in_world @ X54 @ esk3_0))&(((rel_s4 @ (esk5_1 @ X54) @ (esk6_1 @ X54))|~(exists_in_world @ X54 @ esk3_0))&(~(big_p @ X54 @ (esk6_1 @ X54))|~(exists_in_world @ X54 @ esk3_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])). 0.21/0.47 thf(c_0_19, negated_conjecture, ![X3:$i, X11:mu]:(((big_p @ esk4_0 @ X3)|~((rel_s4 @ (esk5_1 @ X11) @ X3))|~((exists_in_world @ X11 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.21/0.47 thf(c_0_20, negated_conjecture, ![X11:mu]:(((rel_s4 @ (esk5_1 @ X11) @ (esk6_1 @ X11))|~((exists_in_world @ X11 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.21/0.47 thf(c_0_21, negated_conjecture, ![X11:mu]:((~((big_p @ X11 @ (esk6_1 @ X11)))|~((exists_in_world @ X11 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_18])). 0.21/0.47 thf(c_0_22, negated_conjecture, ![X11:mu]:(((big_p @ esk4_0 @ (esk6_1 @ X11))|~((exists_in_world @ X11 @ esk3_0)))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.21/0.47 thf(c_0_23, negated_conjecture, (exists_in_world @ esk4_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_18])). 0.21/0.47 thf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])]), ['proof']). 0.21/0.47 # SZS output end CNFRefutation 0.21/0.47 # Parsed axioms : 74 0.21/0.47 # Removed by relevancy pruning/SinE : 0 0.21/0.47 # Initial clauses : 47 0.21/0.47 # Removed in clause preprocessing : 37 0.21/0.47 # Initial clauses in saturation : 10 0.21/0.47 # Processed clauses : 25 0.21/0.47 # ...of these trivial : 0 0.21/0.47 # ...subsumed : 0 0.21/0.47 # ...remaining for further processing : 25 0.21/0.47 # Other redundant clauses eliminated : 0 0.21/0.47 # Clauses deleted for lack of memory : 0 0.21/0.47 # Backward-subsumed : 0 0.21/0.47 # Backward-rewritten : 0 0.21/0.47 # Generated clauses : 13 0.21/0.47 # ...of the previous two non-redundant : 9 0.21/0.47 # ...aggressively subsumed : 0 0.21/0.47 # Contextual simplify-reflections : 0 0.21/0.47 # Paramodulations : 13 0.21/0.47 # Factorizations : 0 0.21/0.47 # NegExts : 0 0.21/0.47 # Equation resolutions : 0 0.21/0.47 # Propositional unsat checks : 0 0.21/0.47 # Propositional check models : 0 0.21/0.47 # Propositional check unsatisfiable : 0 0.21/0.47 # Propositional clauses : 0 0.21/0.47 # Propositional clauses after purity: 0 0.21/0.47 # Propositional unsat core size : 0 0.21/0.47 # Propositional preprocessing time : 0.000 0.21/0.47 # Propositional encoding time : 0.000 0.21/0.47 # Propositional solver time : 0.000 0.21/0.47 # Success case prop preproc time : 0.000 0.21/0.47 # Success case prop encoding time : 0.000 0.21/0.47 # Success case prop solver time : 0.000 0.21/0.47 # Current number of processed clauses : 15 0.21/0.47 # Positive orientable unit clauses : 5 0.21/0.47 # Positive unorientable unit clauses: 0 0.21/0.47 # Negative unit clauses : 0 0.21/0.47 # Non-unit-clauses : 10 0.21/0.47 # Current number of unprocessed clauses: 4 0.21/0.47 # ...number of literals in the above : 12 0.21/0.47 # Current number of archived formulas : 0 0.21/0.47 # Current number of archived clauses : 10 0.21/0.47 # Clause-clause subsumption calls (NU) : 6 0.21/0.47 # Rec. Clause-clause subsumption calls : 4 0.21/0.47 # Non-unit clause-clause subsumptions : 0 0.21/0.47 # Unit Clause-clause subsumption calls : 1 0.21/0.47 # Rewrite failures with RHS unbound : 0 0.21/0.47 # BW rewrite match attempts : 2 0.21/0.47 # BW rewrite match successes : 0 0.21/0.47 # Condensation attempts : 25 0.21/0.47 # Condensation successes : 0 0.21/0.47 # Termbank termtop insertions : 3088 0.21/0.47 0.21/0.47 # ------------------------------------------------- 0.21/0.47 # User time : 0.005 s 0.21/0.47 # System time : 0.004 s 0.21/0.47 # Total time : 0.009 s 0.21/0.47 # Maximum resident set size: 1908 pages 0.21/0.47 0.21/0.47 # ------------------------------------------------- 0.21/0.47 # User time : 0.007 s 0.21/0.47 # System time : 0.005 s 0.21/0.47 # Total time : 0.012 s 0.21/0.47 # Maximum resident set size: 1804 pages 0.21/0.48 EOF